A note on Ramsey numbers with two parameters
نویسندگان
چکیده
منابع مشابه
A note on Ramsey numbers with two parameters
1 The Ramsey number R(G1,G2) is the smallest integer p such that for any graph G on p vertices 2 either G contains G1 or G contains G2, where G denotes the complement of G. In this paper, some 3 new bounds with two parameters for the Ramsey number R(G1,G2), under some assumptions, are 4 obtained. Especially, we prove that R(K6 − e, K6) ≤ 116 and R(K6 − e, K7) ≤ 202, these improve 5 the two uppe...
متن کاملA Note on Two Multicolor Ramsey Numbers
Two new bounds for multicolor Ramsey numbers are proved: R(K3,K3, C4, C4) ≥ 27 and R4(C4) ≤ 19.
متن کاملA note on Ramsey numbers for books
The book with n pages Bn is the graph consisting of n triangles sharing an edge. The book Ramsey number r(Bm, Bn) is the smallest integer r such that either Bm ⊂ G or Bn ⊂ G for every graph G of order r. We prove that there exists a positive constant c such that r(Bm, Bn) = 2n + 3 for all n ≥ cm.
متن کاملA Note on Ramsey Numbers for Fans
For two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that, for any graph G of order N, either G contains G1 as a subgraph or the complement of G contains G2 as a subgraph. A fan Fl is l triangles sharing exactly one vertex. In this note, it is shown that R(Fn, Fm) = 4n + 1 for n ≥ max{m2 − m/2, 11m/2 − 4}. 2010 Mathematics subject classification: primary 05D...
متن کاملA Note on On-line Ramsey Numbers for Quadrilaterals
We consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2006
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2004.12.005